English translation for "chain table"

链表

Example Sentences:

	1.	The whole algorithm adopts single chain table as input / output data structure and there is no need to specify the direction of polygons input 整个算法采用单链表作为输入输出的数据结构且无需限制输入多边形的方向。
	2.	After introducing the main approaches briefly , this paper summarizes and contrast them . it lay emphasis on the research of galerkin fem equations for multiaquifers and its solution , and on the research of basic ideas and implementation of visual mesh auto - generation 。 with an in - depth study on automatic mesh generation dividingtechnology of finite element , computer image processing techniques and visual scientific calculation technology , and under thebased on windows 2000 platform , we work out the foreground programs using visual basic 6 . 0 from microsoft , which possesses friendly programming environment and abounding graph function , while the background programs are accomplished using the powerful function of data base and chain table of delphi 6 . 0 from borland 重点研究了潜水? ?承压水多层结构含水层系统的伽辽金fem方程,并探讨了其数值解法，提出了基于可视化理念的fem剖分软件系统设计的基本思想及其实现的方法。在深入研究有限元自动剖分技术、计算机图形处理技术和科学计算可视化技术的基础上，在windows2000平台下，采用microsoft公司的visualbasic6 . 0与borland公司的delphi6 . 0混合编程,利用vb友好的编程环境和丰富的图形函数来编制前台程序,而后台程序则利用delphi强大的数据库功能和链表功能来完成。
	3.	Moreover , based on in - depth research of " the existing scan - line polygon fill algorithm , the author has introduced a new fast method for clipping arbitrary boundary areas algorithm which uses the edge consistency and the scan - line consistency and adopts sorted chain table , i t can reduce the quantity of calculating intersection points and improve the efficiency of algorithm 另外，作者在对已有的扫描线填充算法深入研究的基础上，介绍一种利用裁剪区域的边的连贯性和扫描线的连贯性，从而减少求交计算量、提高算法效率的有序链表的快速裁剪算法。
	4.	Firstly , according to our study on the psychology of travelers , we build the passenger - route - select model with the purpose of " least change firstly , shortest distance secondly " , propose the question of bus route aggregation and the n shortest paths algorithm combining dijkstra algorithm and moore - pape " s chain table management technology , which is proved valid 首先在对乘客出行心理研究基础上，提出了“以换乘次数最少为第一目标，距离最短为第二目标”的公交乘客出行路径选择模型和公交路径集问题以及结合dijkstra算法和moore ? pape算法链表管理技术的n条最短路径算法，系统的运行结果验证了该算法的有效性。

Similar Words：

"chain sweep" English translation, "chain switch" English translation, "chain swivel" English translation, "chain system" English translation, "chain system of docks" English translation, "chain take up" English translation, "chain take-up" English translation, "chain taker pipe" English translation, "chain takerpipe" English translation, "chain tape" English translation